Performance improvement of microbial fuel cell through artificial intelligence

The current work introduces an enhancement in the performance of the microbial fuel cell through estimating the optimal set of controlling parameters. The maximization of both power density (PD) and the percentage of chemical oxygen demand (COD) removal were considered as the enhancement in the cell's performance. Three main parameters in terms of performance as well as commercialization are the system's inputs; the Pt which takes the range of 0.1‐0.5 mg/cm², the degree of sulphonation in sulfonated‐poly‐ether‐ether‐ketone that changes in the range of 20‐80%, and the rate of aeration of cathode which varies between 10 and 150 mL/min. From the experimental dataset, two robust adaptive neuro‐fuzzy inference system models based on the fuzzy logic technique have been constructed. The comparisons between the models' outputs and the experimental data showed well‐fitting in both training and testing datasets. The mean squared errors of the PD model, for testing and whole datasets, were found 2.575 and 0.909 while for the COD model it showed 19.242 and 6.791, respectively. Then, based on the two fuzzy models, a Particle Swarm Optimization algorithm has been used to determine the best parameters that maximize both of the PD and the COD removal of the cell. The optimization process was utilized for single and multi‐object optimization processes. In the single optimization, the resulting maximums of the PD and the COD removal were found 62.844 (mW/m²) and 99.99 (%), respectively. Whereas, in the multi‐object optimization, the values of 61.787 (mW/m²) and 96.21 (%) were reached as the maximums for the PD and COD, respectively. This implies that, in both cases of optimization processes, the adopted methodology can efficiently enhance the microbial fuel cell performances than the previous work.     

Sustainable ammonia production through process synthesis and global optimization

Current ammonia production technologies have a significant carbon footprint. In this study, we present a process synthesis and global optimization framework to discover the efficient utilization of renewable resources in ammonia production. Competing technologies are incorporated in a process superstructure where biomass, wind, and solar routes are compared with the natural gas-based reference case. A deterministic global optimization-based branch-and-bound algorithm is used to solve the resulting large-scale nonconvex mixed-integer nonlinear programming problem (MINLP). Case studies for Texas, California, and Iowa are conducted to examine the effects of different feedstock prices and availabilities. Results indicate that profitability of ammonia production is highly sensitive to feedstock and electricity prices, as well as greenhouse gas (GHG) restrictions. Under strict 75% GHG reductions, biomass to ammonia route is found to be competitive with natural gas route, whereas wind and solar to ammonia routes require further improvement to compete with those two routes. © 2018 American Institute of Chemical Engineers AIChE J, 65: e16498 2019     

Modeling of compressive strength of cemented sandy soil

This paper attempted to show the application of particle swarm optimization in the prediction of the compressive strength of cement sandy soil from the curing period, porosity of sample and percentage of cement. The results of the study show that the unconfined compressive strength of the cement stabilized sandy soil increases with an increasing cement content curing time period. Moreover the compressive strength decreases with an increasing porosity. The compressive strength improvement due to cement treatment has a larger increase in samples with less porosity. In addition, particle swarm optimization algorithm is and accurate technique in estimation of compressive strength of cement stabilized sandy soil. In order to compare of existing correlations, a total number of 100 unconfined compressive tests and 15 scanning electron microscope tests have been conducted on cemented Babolsar sand. It can be concluded that compared to existing correlations models, particle swarm optimization algorithm models give more reliable prediction about compressive strength of cement satblized sandy soil. Moreover, the sensitivity analysis of the polynomial model shows that cement content and porosity have significant impact on predicting unconfined compressive strength.     

A Dynamic Memory Allocation Optimization Mechanism Based on Spark

Spark is a distributed data processing framework based on memory. Memory allocation is a focus question of Spark research. A good memory allocation scheme can effectively improve the efficiency of task execution and memory resource utilization of the Spark. Aiming at the memory allocation problem in the Spark2.x version, this paper optimizes the memory allocation strategy by analyzing the Spark memory model, the existing cache replacement algorithms and the memory allocation methods, which is on the basis of minimizing the storage area and allocating the execution area according to the demand. It mainly including two parts: cache replacement optimization and memory allocation optimization. Firstly, in the storage area, the cache replacement algorithm is optimized according to the characteristics of RDD Partition, which is combined with PCA dimension. In this section, the four features of RDD Partition are selected. When the RDD cache is replaced, only two most important features are selected by PCA dimension reduction method each time, thereby ensuring the generalization of the cache replacement strategy. Secondly, the memory allocation strategy of the execution area is optimized according to the memory requirement of Task and the memory space of storage area. In this paper, a series of experiments in Spark on Yarn mode are carried out to verify the effectiveness of the optimization algorithm and improve the cluster performance.     

A novel differential evolution mapping technique for generic combinatorial optimization problems

Differential evolution is primarily designed and used to solve continuous optimization problems. Therefore, it has not been widely considered as applicable for real-world problems that are characterized by permutation-based combinatorial domains. Many algorithms for solving discrete problems using differential evolution have been proposed, some of which have achieved promising results. However, to enhance their performance, they require improvements in many aspects, such as their convergence speeds, computational times and capabilities to solve large discrete problems. In this paper, we present a new mapping method that may be used with differential evolution to solve combinatorial optimization problems. This paper focuses specifically on the mapping component and its effect on the performance of differential evolution. Our method maps continuous variables to discrete ones, while at the same time, it directs the discrete solutions produced towards optimality, by using the best solution in each generation as a guide. To judge its performance, its solutions for instances of well-known discrete problems, namely: 0/1 knapsack, traveling salesman and traveling thief problems, are compared with those obtained by 8 other state-of-the-art mapping techniques. To do this, all mapping techniques are used with the same differential evolution settings. The results demonstrated that our technique significantly outperforms the other mapping methods in terms of the average error from the best-known solution for the traveling salesman problems, and achieves promising results for both the 0/1 knapsack and the traveling thief problems.     

基于分解的多目标花朵授粉算法

在过去几十年里，许多多目标进化算法被广泛应用于解决多目标优化问题，其中一种比较流行的多目标进化算法是基于分解的多目标进化算法(MOEA/D)。花朵授粉算法是一种启发式优化算法，但迄今为止，花朵授粉算法在基于分解的多目标进化算法领域的研究还非常少。本文在基于分解的多目标进化算法的框架下，将花朵授粉算法拓展至多目标优化领域，提出一种基于分解的多目标花朵授粉算法(MOFPA/D)。此外，为了保证非支配解的多样性，本文提出一种基于网格的目标空间分割法，该方法从找到的Pareto最优解集中筛选出一定数量且分布均匀的Pareto最优解。实验结果表明，基于分解的多目标花朵授粉算法在收敛性与多样性方面均优于基于分解的多目标进化算法。     

Tuning of Active Disturbance Rejection Control with application to power plant furnace regulation

Active Disturbance Rejection Control (ADRC) is emerging as a promising solution in dealing with the unmeasurable disturbances and unknown uncertainties, which are treated in a lumped manner and augmented as an extended state variable. Subsequently, an extended state observer (ESO) is designed to estimate and cancel the combined uncertain term in real time, modifying the uncertain plant to behave like a nominal model consisting of integrators. In the original ADRC formulation, the plant model is assumed to be of delay-free and its order is assumed to be equal to that of the real plant. However, a low-order ADRC is preferred and received a wide acceptance in practice because of its simplicity. Currently, the feasibility of such practice is not clearly revealed as well as its potential dangers. To this end, this paper analyzes the control mechanism from the perspective of the modified plant, which, in turn, would give guidance to parameter tuning. The effect of each parameter on the compensation efficiency and stability conditions of the modified plant is analyzed, based on which a complete tuning procedure for ADRC is developed where the initial settings is derived from the existing PI controller parameters. Finally, the proposed tuning method is experimentally used for a furnace pressure regulation of a 1000MW power plant, validating the feasibility of the low-order ADRC, even in the absence of both dynamic model and the information on the model order.     

Couple-based particle swarm optimization for short-term hydrothermal scheduling

A novel couple-based particle swarm optimization (CPSO) is presented in this paper, and applied to solve the short-term hydrothermal scheduling (STHS) problem. In CPSO, three improvements are proposed compared to the canonical particle swarm optimization, aimed at overcoming the premature convergence problem. Dynamic particle couples, a unique sub-group structure in maintaining population diversity, is adopted as the population topology, in which every two particles compose a particle couple randomly in each iteration. Based on this topology, an intersectional learning strategy using the partner learning information of last iteration is employed in every particle couple, which can automatically reveal useful history information and reduce the overly rapid evolution speed. Meanwhile, the coefficients of each particle in a particle couple are set as distinct so that the particle movement patterns can be described and controlled more precisely. In order to demonstrate the effectiveness of our proposed CPSO, the algorithm is firstly tested with four multimodal benchmark functions, and then applied to solve an engineering multimodal problem known as STHS, in which two typical test systems with four different cases are tested, and the results are compared with those of other evolutionary methods published in the literature.